Bijective enumeration of permutations starting with a longest increasing subsequence

نویسنده

  • Greta Panova
چکیده

We prove a formula for the number of permutations in Sn such that their first n− k entries are increasing and their longest increasing subsequence has length n− k. This formula first appeared as a consequence of character polynomial calculations in recent work of Adriano Garsia and Alain Goupil. We give two ‘elementary’ bijective proofs of this result and of its q-analogue, one proof using the RSK correspondence and one only permutations. Résumé. Nous prouvons une formule pour le nombre des permutations dans Sn dont les prémiers n − k entrées sont croissantes et dont la plus longue sous-súite croissante est de longeur n− k. Cette formule est d’abord apparue en conséquence de calculs sur les polynômes caractères des travaux récents de Adriano Garsia et Alain Goupil. Nous donnons deux preuves bijectifs ‘élementaires’ de cet résultat et de son q-analogue, une preuve employant le corréspondance RSK et une autre n’employant que les permutations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enumeration of permutations starting with a longest increasing subsequence

We prove a formula for the number of permutations in Sn such that their first n−k entries are increasing and their longest increasing subsequence has length n − k. This formula first appeared as a consequence of character polynomial calculations in the work of Adriano Garsia, [2]. We give an elementary proof of this result and also of its q-analogue. In [2], Adriano Garsia derived as a conseque...

متن کامل

Combinatorial applications of symmetric function theory to certain classes of permutations and truncated tableaux

The purpose of this dissertation is to study certain classes of permutations and plane partitions of truncated shapes. We establish some of their enumerative and combinatorial properties. The proofs develop methods and interpretations within various fields of algebraic combinatorics, most notably the theory of symmetric functions and their combinatorial properties. The first chapter of this the...

متن کامل

Gl(n,q) and Increasing Subsequences in Nonuniform Random Permutations

Connections between longest increasing subsequences in random permutations and eigenvalues of random matrices with complex entries have been intensely studied. This note applies properties of random elements of the finite general linear group to obtain results about the longest increasing subsequence in non-uniform random permutations.

متن کامل

Longest Alternating Subsequences in Pattern-Restricted Permutations

Inspired by the results of Stanley and Widom concerning the limiting distribution of the lengths of longest alternating subsequences in random permutations, and results of Deutsch, Hildebrand and Wilf on the limiting distribution of the longest increasing subsequence for pattern-restricted permutations, we find the limiting distribution of the longest alternating subsequence for pattern-restric...

متن کامل

Longest Increasing Subsequences of Random Colored Permutations

We compute the limit distribution for the (centered and scaled) length of the longest increasing subsequence of random colored permutations. The limit distribution function is a power of that for usual random permutations computed recently by Baik, Deift, and Johansson (math.CO/9810105). In the two–colored case our method provides a different proof of a similar result by Tracy and Widom about t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010